Results for 'Keng Yap Ng'

999 found
Order:
  1.  11
    Exploring Sources of Satisfaction and Dissatisfaction in Airbnb Accommodation Using Unsupervised and Supervised Topic Modeling.Kai Ding, Wei Chong Choo, Keng Yap Ng, Siew Imm Ng & Pu Song - 2021 - Frontiers in Psychology 12.
    This study aims to examine key attributes affecting Airbnb users' satisfaction and dissatisfaction through the analysis of online reviews. A corpus that comprises 59,766 Airbnb reviews form 27,980 listings located in 12 different cities is analyzed by using both Latent Dirichlet Allocation and supervised LDA approach. Unlike previous LDA based Airbnb studies, this study examines positive and negative Airbnb reviews separately, and results reveal the heterogeneity of satisfaction and dissatisfaction attributes in Airbnb accommodation. In particular, the emergence of the topic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  28
    On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.
    In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of certain order functions. This leads us to investigate certain high r.e. degrees, which resemble ∅′ very closely in terms of ∅′-jump traceability. In particular, we will construct an ultrahigh degree which is cappable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  16
    On strongly jump traceable reals.Keng Meng Ng - 2008 - Annals of Pure and Applied Logic 154 (1):51-69.
    In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is image-complete.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  35
    On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
    Semi-hyperhypersimple c.e. sets, also known as diagonals, were introduced by Kummer. He showed that by considering an analogue of hyperhypersimplicity, one could characterize the sets which are the Halting problem relative to arbitrary computable numberings. One could also consider half of splittings of maximal or hyperhypersimple sets and get another variant of maximality and hyperhypersimplicity, which are closely related to the study of automorphisms of the c.e. sets. We investigate the Turing degrees of these classes of c.e. sets. In particular, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  18
    On the Degree Structure of Equivalence Relations Under Computable Reducibility.Keng Meng Ng & Hongyuan Yu - 2019 - Notre Dame Journal of Formal Logic 60 (4):733-761.
    We study the degree structure of the ω-c.e., n-c.e., and Π10 equivalence relations under the computable many-one reducibility. In particular, we investigate for each of these classes of degrees the most basic questions about the structure of the partial order. We prove the existence of the greatest element for the ω-c.e. and n-computably enumerable equivalence relations. We provide computable enumerations of the degrees of ω-c.e., n-c.e., and Π10 equivalence relations. We prove that for all the degree classes considered, upward density (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  14
    Effective Domination and the Bounded Jump.Keng Meng Ng & Hongyuan Yu - 2020 - Notre Dame Journal of Formal Logic 61 (2):203-225.
    We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via a reduction with use (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  45
    Semantic Richness Effects in Spoken Word Recognition: A Lexical Decision and Semantic Categorization Megastudy.Winston D. Goh, Melvin J. Yap, Mabel C. Lau, Melvin M. R. Ng & Luuan-Chin Tan - 2016 - Frontiers in Psychology 7.
  8.  7
    Separating weak α-change and α-change genericity.Michael McInerney & Keng Meng Ng - 2022 - Annals of Pure and Applied Logic 173 (7):103134.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  15
    Ω-change randomness and weak Demuth randomness.Johanna N. Y. Franklin & Keng Meng Ng - 2014 - Journal of Symbolic Logic 79 (3):776-791.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  10
    Every Δ20 degree is a strong degree of categoricity.Barbara F. Csima & Keng Meng Ng - 2022 - Journal of Mathematical Logic 22 (3).
    A strong degree of categoricity is a Turing degree [Formula: see text] such that there is a computable structure [Formula: see text] that is [Formula: see text]-computably categorical (there is a [Formula: see text]-computable isomorphism between any two computable copies of [Formula: see text]), and such that there exist two computable copies of [Formula: see text] between which every isomorphism computes [Formula: see text]. The question of whether every [Formula: see text] degree is a strong degree of categoricity has been (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  22
    How We Think about Temporal Words: A Gestural Priming Study in English and Chinese.Melvin M. R. Ng, Winston D. Goh, Melvin J. Yap, Chi-Shing Tse & Wing-Chee So - 2017 - Frontiers in Psychology 8.
  12.  29
    Effective Packing Dimension and Traceability.Rod Downey & Keng Meng Ng - 2010 - Notre Dame Journal of Formal Logic 51 (2):279-290.
    We study the Turing degrees which contain a real of effective packing dimension one. Downey and Greenberg showed that a c.e. degree has effective packing dimension one if and only if it is not c.e. traceable. In this paper, we show that this characterization fails in general. We construct a real $A\leq_T\emptyset''$ which is hyperimmune-free and not c.e. traceable such that every real $\alpha\leq_T A$ has effective packing dimension 0. We construct a real $B\leq_T\emptyset'$ which is not c.e. traceable such (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  26
    Complexity of equivalence relations and preorders from computability theory.Egor Ianovski, Russell Miller, Keng Meng Ng & André Nies - 2014 - Journal of Symbolic Logic 79 (3):859-881.
    We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relationsR,S, a componentwise reducibility is defined byR≤S⇔ ∃f∀x, y[x R y↔fS f].Here,fis taken from a suitable class of effective functions. For us the relations will be on natural numbers, andfmust be computable. We show that there is a${\rm{\Pi }}_1^0$-complete equivalence relation, but no${\rm{\Pi }}_k^0$-complete fork≥ 2. We show that${\rm{\Sigma }}_k^0$preorders arising naturally in the above-mentioned areas are${\rm{\Sigma }}_k^0$-complete. This includes polynomial timem-reducibility on (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  22
    Turing degrees in Polish spaces and decomposability of Borel functions.Vassilios Gregoriades, Takayuki Kihara & Keng Meng Ng - 2020 - Journal of Mathematical Logic 21 (1):2050021.
    We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  15
    Splitting into degrees with low computational strength.Rod Downey & Keng Meng Ng - 2018 - Annals of Pure and Applied Logic 169 (8):803-834.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  23
    Categorical linearly ordered structures.Rod Downey, Alexander Melnikov & Keng Meng Ng - 2019 - Annals of Pure and Applied Logic 170 (10):1243-1255.
  17.  39
    Jump inversions inside effectively closed sets and applications to randomness.George Barmpalias, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (2):491 - 518.
    We study inversions of the jump operator on ${\mathrm{\Pi }}_{1}^{0}$ classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random. Both of the classes coincide with the degrees above 0′ which are not 0′-dominated. A (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  13
    Incomparability in local structures of s -degrees and Q -degrees.Irakli Chitaia, Keng Meng Ng, Andrea Sorbi & Yue Yang - 2020 - Archive for Mathematical Logic 59 (7-8):777-791.
    We show that for every intermediate \ s-degree there exists an incomparable \ s-degree. As a consequence, for every intermediate \ Q-degree there exists an incomparable \ Q-degree. We also show how these results can be applied to provide proofs or new proofs of upper density results in local structures of s-degrees and Q-degrees.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  43
    Strengthening prompt simplicity.David Diamondstone & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (3):946 - 972.
    We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤ wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cuppable. However, it is a wtt-degree notion, and we show that it characterizes the degrees which satisfy a wtt-degree notion very (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  20.  10
    Cupping and Jump Classes in the Computably Enumerable Degrees.Noam Greenberg, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (4):1499-1545.
    We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are${\operatorname {\mathrm {low}}}_3$-cuppable, or indeed${\operatorname {\mathrm {low}}}_n$cuppable for anyn, refuting a conjecture by Li. On the other hand, we show that one cannot improve highness to superhighness. We also show that the${\operatorname {\mathrm {low}}}_2$-cuppable degrees coincide with the array computable-cuppable degrees, giving a full understanding of the latter class.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  32
    The importance of Π1 0 classes in effective randomness.George Barmpalias, Andrew E. M. Lewis & Keng Meng Ng - 2010 - Journal of Symbolic Logic 75 (1):387-400.
    We prove a number of results in effective randomness, using methods in which Π⁰₁ classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22.  34
    Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.
  23.  22
    Automatic and polynomial-time algebraic structures.Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Kalimullin, Alexander Melnikov & Keng Meng Ng - 2019 - Journal of Symbolic Logic 84 (4):1630-1669.
    A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24.  13
    Computable linear orders and products.Andrey N. Frolov, Steffen Lempp, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (2):605-623.
    We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$, $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  23
    On Δ 2 0 -categoricity of equivalence relations.Rod Downey, Alexander G. Melnikov & Keng Meng Ng - 2015 - Annals of Pure and Applied Logic 166 (9):851-880.
  26.  24
    Abelian p-groups and the Halting problem.Rodney Downey, Alexander G. Melnikov & Keng Meng Ng - 2016 - Annals of Pure and Applied Logic 167 (11):1123-1138.
  27.  57
    Limits on jump inversion for strong reducibilities.Barbara F. Csima, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (4):1287-1296.
    We show that Sacks' and Shoenfield's analogs of jump inversion fail for both tt- and wtt-reducibilities in a strong way. In particular we show that there is a ${\mathrm{\Delta }}_{2}^{0}$ set B > tt ∅′ such that there is no c.e. set A with A′ ≡ wtt B. We also show that there is a ${\mathrm{\Sigma }}_{2}^{0}$ set C > tt ∅′ such that there is no ${\mathrm{\Delta }}_{2}^{0}$ set D with D′ ≡ wtt C.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  28.  4
    Limit Complexities, Minimal Descriptions, and -Randomness.Rodney Graham Downey, Lu Liu, Keng Meng Ng & Daniel Turetsky - forthcoming - Journal of Symbolic Logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  24
    Primitive recursive equivalence relations and their primitive recursive complexity.Luca San Mauro, Nikolay Bazhenov, Keng Meng Ng & Andrea Sorbi - forthcoming - Computability.
    The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the polynomial-time reducibility. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  10
    Computability of polish spaces up to homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.
    We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a $\Delta ^0_2$ Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal $\alpha $, an effectively closed set not homeomorphic to any $0^{}$-computable Polish space; this answers a question of Nies. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  19
    Punctual Categoricity and Universality.Rod Downey, Noam Greenberg, Alexander Melnikov, Keng Meng Ng & Daniel Turetsky - 2020 - Journal of Symbolic Logic 85 (4):1427-1466.
    We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures can possess arbitrarily complex (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  52
    Lowness for effective Hausdorff dimension.Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky & Rebecca Weber - 2014 - Journal of Mathematical Logic 14 (2):1450011.
    We examine the sequences A that are low for dimension, i.e. those for which the effective dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness, we show that lowness for dimension can be characterized in several ways. It is equivalent to lowishness for randomness, namely, that every Martin-Löf random sequence has effective dimension (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  37
    A Friedberg enumeration of equivalence structures.Rodney G. Downey, Alexander G. Melnikov & Keng Meng Ng - 2017 - Journal of Mathematical Logic 17 (2):1750008.
    We solve a problem posed by Goncharov and Knight 639–681, 757]). More specifically, we produce an effective Friedberg enumeration of computable equivalence structures, up to isomorphism. We also prove that there exists an effective Friedberg enumeration of all isomorphism types of infinite computable equivalence structures.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34. The importance of $\Pi _1^0$ classes in effective randomness. The Journal of Symbolic Logic, vol. 75.George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng & Frank Stephan - 2012 - Bulletin of Symbolic Logic 18 (3):409-412.
  35.  9
    George Barmpalias, Andrew E. M. Lewis and Keng Meng NG. The importance of Π 0 1 classes in effective randomness. The Journal of Symbolic Logic, vol. 75 (2010), pp. 387–400. - George Barmpalias, Andrew E. M. Lewis and Frank Stephan. Π 0 1 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, vol. 156 (2008), pp. 21–38. - Antonin Kučera. Measure, Π 0 1 classes and complete extensions of PA. Recursion Theory Week (Oberwofach, 1984). Lecture Notes in Mathematics, vol. 1141. Springer, Berlin, 1985, pp. 245–259. - Frank Stephan. Martin-Löf randomness and PA complete sets. Logic Colloquium '02. Lecture Notes in Logic, vol. 27, Association for Symbolic Logic, La Jolla, CA, 2006, pp. 342–348. [REVIEW]Douglas Cenzer - 2012 - Bulletin of Symbolic Logic 18 (3):409-412.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  42
    Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
    We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field. With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  11
    The Structure of d.r.e. Degrees.Yong Liu - 2021 - Bulletin of Symbolic Logic 27 (2):218-219.
    This dissertation is highly motivated by d.r.e. Nondensity Theorem, which is interesting in two perspectives. One is that it contrasts Sacks Density Theorem, and hence shows that the structures of r.e. degrees and d.r.e. degrees are different. The other is to investigate what other properties a maximal degree can have.In Chapter 1, we briefly review the backgrounds of Recursion Theory which motivate the topics of this dissertation.In Chapter 2, we introduce the notion of $$ -cupping degree. It is closely related (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  5
    Hanʼgugin ŭi yulli sasangsa.Ki-yŏng Yi (ed.) - 2000 - Sŏul Tʻŭkpyŏlsi: Hangmunsa.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  5
    Tamnon ŭi konggan: chuchʻe chʻŏrhak esŏ tamnonhak ŭro.Chŏng-U. Yi - 1994 - Sŏul-si: Minŭmsa.
    현대철학의 핵심문제로 제시되어온 주체의 개념을 유 럽철학사의 맥락으로 논한 저서.
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. Tongyang chŏrhak yŏnʼgu.Sŭng-guk Yu - 1983 - Sŏul: Kŭnyŏk Sŏje.
     
    Export citation  
     
    Bookmark  
  41. Segye sok ŭi Hanʼguk Yugyo.Chŏng-gi Sŏ - 2003 - Sŏul-si: Sallimtʻŏ.
     
    Export citation  
     
    Bookmark  
  42. Tʻoegye mundo Tosan kŭmmun chehyŏnjip.U. -sŏng Yi (ed.) - 1982 - Sŏul: Asea Munhwasa.
     
    Export citation  
     
    Bookmark  
  43. Yŏksajŏk yumullon.Sŭng-bok Yi (ed.) - 1978 - [Tokyo]: Hagu Sŏbang.
     
    Export citation  
     
    Bookmark  
  44.  1
    Ch'ŏrhak chisik.Chŏng-sul Yŏn - 2014 - [P'yŏngyang]: Sahoe Kwahak Ch'ulp'ansa.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  45. Hyŏndae sasang.Pyŏng-uk An - 1958
     
    Export citation  
     
    Bookmark  
  46.  10
    Moral Judgement in Early Bilinguals: Language Dominance Influences Responses to Moral Dilemmas.Galston Wong & Bee Chin Ng - 2018 - Frontiers in Psychology 9.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  47. Kwahak kwa sago.Hŭng-nyŏl So - 1983 - Sŏul Tʻŭkpyŏlsi: Kyŏngmunsa.
    No categories
     
    Export citation  
     
    Bookmark  
  48.  5
    Hyŏndae hyŏngpŏphak: iron kwa pangbŏp.Sŏng-jo An - 2011 - Sŏul-si: Kyŏngin Munhwasa.
    Direct download  
     
    Export citation  
     
    Bookmark  
  49. Moral-Dilemma Judgments.Bertram Gawronski, Nyx Ng & Michael T. Dale - forthcoming - In Simon Laham (ed.), Handbook of Ethics and Social Psychology. Cheltenham, UK: Edward Elgar Publishing.
    The current chapter provides an overview of research on responses in moral dilemmas where maximization of outcomes for the greater good (utilitarianism) conflicts with adherence to moral norms (deontology). Expanding on a description of the traditional paradigm to study moral-dilemma judgments (i.e., the trolley problem), the chapter reviews the most prominent dual-process account of moral-dilemma judgments, normative conclusions that have been derived from this account, and criticisms raised against this line of work. The following sections review advances in the development (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  50. Sirhakpʻa ŭi chŏngchʻi, sahoe kaehyŏngnon.Yŏng-gyo O. - 2008 - Sŏul-si: Hyean.
     
    Export citation  
     
    Bookmark  
1 — 50 / 999